13. Legrendre's Formula

Legendre

Legendre.default

Legendre.numeric

Legendre.vli

Given a positive integer <code>n</code> and a prime <code>p</code>, the Legendre's Formula finds the largest integer <code>x</code> such that <code>p^x</code> divides the factorial of <code>n</code>, <code>n!</code>.

Multi-precision library that allows to store and operate with arbitrarily big integers without
loss of precision. It includes a large list of tools to work with them, like:
- Arithmetic and logic operators
- Modular-arithmetic operators
- Computer Number Theory utilities
- Probabilistic primality tests
- Factorization algorithms
- Random generators of diferent types of integers.

Javier Cuadrado

VeryLargeIntegers

Store and Operate with Arbitrarily Large Integers

13. Legrendre's Formula function

<dl><dt>n</dt>
<dd>a positive integer; object of class vli or 32 bits integer</dd>
<dt>p</dt>
<dd>a prime number; object of class vli or 32 bits integer</dd></dl>

Arguments

Author

Legrendre's Formula for vli Objects — 13. Legrendre's Formula

<dl>

<dt>n</dt>
<dd>a positive integer; object of class vli or 32 bits integer</dd>


<dt>p</dt>
<dd>a prime number; object of class vli or 32 bits integer</dd>

</dl>

13. Legrendre's Formula: Legrendre's Formula for vli Objects

Description

Usage

Value

Arguments

Author

Examples